Algorithm 37. Solution of sparse linear equation systems
نویسندگان
چکیده
منابع مشابه
Parallel iterative solution method for large sparse linear equation systems
Solving sparse systems of linear equations is at the heart of scientific computing. Large sparse systems often arise in science and engineering problems. One such problem we consider in this paper is the steadystate analysis of Continuous Time Markov Chains (CTMCs). CTMCs are a widely used formalism for the performance analysis of computer and communication systems. A large variety of useful pe...
متن کاملSolution of Sparse Linear Systems
We consider the solution of a linear system Ax = b on a distributed memory machine when the matrix A is large, sparse and symmetric positive deenite. In a previous paper we developed an algorithm to compute a ll-reducing nested dissection ordering of A on a distributed memory machine. We n o w develop algorithms for the remaining steps of the solution process. The large-grain task parallelism r...
متن کاملScalable Iterative Solution of Sparse Linear Systems
The eeciency of a parallel implementation of the conjugate gradient method precon-ditioned by an incomplete Cholesky factorization can vary dramatically depending on the column ordering chosen. One method to minimize the number of major parallel steps is to choose an ordering based on a coloring of the symmetric graph representing the nonzero adjacency structure of the matrix. In this paper, we...
متن کاملEecient Approximate Solution of Sparse Linear Systems
We consider the problem of approximate solution e x of a linear system Ax = b over the reals, such that kAe x ? bk kbk; for a given ; 0 < < 1: This is one of the most fundamental of all computational problems. Let (A) = kAkkA ?1 k be the condition number of the n n input matrix A. Sparse, diagonally dominant (DD) linear systems appear very frequently in the solution of linear systems associated...
متن کاملSparse Solution of Under-determined Linear Systems
We study an unconstrained version of the lq minimization for the sparse solution of under-determined linear systems for 0 < q ≤ 1. Although the minimization is nonconvex when q < 1, we introduce a regularization and develop an iterative algorithm. We show that the iterative algorithm converges and the iterative solutions converge to the sparse solution under some additional assumptions on under...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applicationes Mathematicae
سال: 1974
ISSN: 1233-7234,1730-6280
DOI: 10.4064/am-14-3-481-511